Note : Lot-Sizing Problems with Backlogging for Batch Production
نویسندگان
چکیده
منابع مشابه
Algorithms for Stochastic Lot-Sizing Problems with Backlogging
As a traditional model in the operations research and management science domain, deterministic lot-sizing problem is embedded in many application problems such as production and inventory planning and has been consistently drawing attentions from researchers. In this paper we consider basic versions of lot-sizing models in which problem parameters are stochastic and develop corresponding scenar...
متن کاملAn optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
An Optimization Framework for Solving Capacitated Multi-level Lot-sizing Problems with Backlogging Tao Wu†, Leyuan Shi†,>, Joseph Geunes‡, Kerem Akartunalı∗ † Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706 ‡ Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611 ∗ Department of Management Science, Univ...
متن کاملUncapacitated lot sizing with backlogging: the convex hull
An explicit description of the convex hull of solutions to the uncapacitated lot-sizing problem with backlogging, in its natural space of production, setup, inventory and backlogging variables, has been an open question for many years. In this paper, we identify valid inequalities that subsume all previously known valid inequalities for this problem. We show that these inequalities are enough t...
متن کاملFacets for Single Module and Multi-Module Capacitated Lot-Sizing Problems without Backlogging
In this paper, we consider the well-known constant-batch lot-sizing problem, which we refer to as the single module capacitated lot-sizing (SMLS) problem, and multi-module capacitated lot-sizing (MMLS) problem. We provide sufficient conditions under which the (k, l, S, I) inequalities of Pochet and Wolsey (Math of OR 18: 767-785, 1993), the mixed (k, l, S, I) inequalities, derived using mixing ...
متن کاملLot Sizing with Piecewise Concave Production Costs
We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming (DP) algorithm to solve this problem and answer an open question in the literature: we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Industrial Engineers
سال: 2014
ISSN: 1225-0988
DOI: 10.7232/jkiie.2014.40.4.424